________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:19:21
Input Data from:  dataset113.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,0635
Average f[i]   :4150
Average g[i,j] :2000
Total demand   :11310
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 25
> Selected Move:	1810	1	-1	3	6000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0    >new incumb.: 1810


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 28
> Selected Move:	2460	1	-1	2	10000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0    >new incumb.: 2460


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 32
> Selected Move:	3030	1	-1	6	15000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0    >new incumb.: 3030


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 34
> Selected Move:	3320	1	-1	5	20000


> New Y[]: 
	
	 2  3  1  1  0  1  1  0  0  0    >new incumb.: 3320


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 24
> Selected Move:	3320	3	3	7	19500


> New Y[]: 
	
	 2  3  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 22
> Selected Move:	3620	3	5	4	20000


> New Y[]: 
	
	 2  3  1  0  1  0  1  1  0  0    >new incumb.: 3620


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 23
> Selected Move:	3400	3	4	9	20500


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 23
> Selected Move:	3262	3	7	4	20500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 19
> Selected Move:	3295	3	9	3	20500


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 21
> Selected Move:	3250	3	4	8	19500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 30
> Selected Move:	3250	3	3	7	19000


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 31
> Selected Move:	3110	2	8	-1	14500


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 27
> Selected Move:	3000	3	2	9	16500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 24
> Selected Move:	3000	3	7	2	15000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 25
> Selected Move:	3170	1	-1	5	20000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 19
> Selected Move:	3140	3	9	4	19500


> New Y[]: 
	
	 2  3  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 24
> Selected Move:	3140	3	6	7	20000


> New Y[]: 
	
	 2  3  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 26
> Selected Move:	3070	3	5	8	19500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 29
> Selected Move:	3100	3	4	9	20000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 24
> Selected Move:	3100	3	7	6	19500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 24
> Selected Move:	3140	3	8	3	21000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 17
> Selected Move:	3000	2	6	-1	16000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 28
> Selected Move:	2970	3	9	4	15500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 31
> Selected Move:	3070	1	-1	8	20000


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 27
> Selected Move:	3070	3	3	6	19000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 27
> Selected Move:	2970	2	8	-1	14500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 21
> Selected Move:	2970	3	2	7	16000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 30
> Selected Move:	2913	1	-1	8	20500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 27
> Selected Move:	2790	3	8	5	21000


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 18
> Selected Move:	2740	3	5	9	22000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 13
> Selected Move:	3050	3	6	2	21000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 20
> Selected Move:	2983	3	4	5	20500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,38

## ITERATION 32 #######################


> Neighbours evaluated; 20
> Selected Move:	2920	2	5	-1	15500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 33 #######################


> Neighbours evaluated; 23
> Selected Move:	2890	3	9	4	15000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 34 #######################


> Neighbours evaluated; 25
> Selected Move:	2780	3	2	9	17000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 35 #######################


> Neighbours evaluated; 25
> Selected Move:	2860	3	7	3	17500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 36 #######################


> Neighbours evaluated; 24
> Selected Move:	2920	3	4	6	17000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 37 #######################


> Neighbours evaluated; 20
> Selected Move:	2890	3	9	4	16500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 38 #######################


> Neighbours evaluated; 26
> Selected Move:	2860	3	3	9	16500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,395

## ITERATION 39 #######################


> Neighbours evaluated; 22
> Selected Move:	2740	3	6	2	15500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 40 #######################


> Neighbours evaluated; 22
> Selected Move:	2960	1	-1	8	20000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 41 #######################


> Neighbours evaluated; 21
> Selected Move:	2933	3	8	3	21500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 42 #######################


> Neighbours evaluated; 16
> Selected Move:	2950	3	9	5	20500


> New Y[]: 
	
	 2  3  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 43 #######################


> Neighbours evaluated; 25
> Selected Move:	2843	3	3	9	20500


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 44 #######################


> Neighbours evaluated; 19
> Selected Move:	2800	3	4	3	21000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 45 #######################


> Neighbours evaluated; 18
> Selected Move:	2918	3	5	8	20500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 46 #######################


> Neighbours evaluated; 19
> Selected Move:	2770	3	9	7	20000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 47 #######################


> Neighbours evaluated; 28
> Selected Move:	2933	3	8	6	20500


> New Y[]: 
	
	 2  3  1  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 48 #######################


> Neighbours evaluated; 24
> Selected Move:	2680	3	6	4	21000


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 49 #######################


> Neighbours evaluated; 22
> Selected Move:	2648	3	4	5	20500


> New Y[]: 
	
	 2  3  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 50 #######################


> Neighbours evaluated; 24
> Selected Move:	2630	3	3	8	19000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,395

## ITERATION 51 #######################


> Neighbours evaluated; 24
> Selected Move:	2670	3	2	6	20000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,4

## ITERATION 52 #######################


> Neighbours evaluated; 27
> Selected Move:	2740	3	5	9	21000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,405

## ITERATION 53 #######################


> Neighbours evaluated; 17
> Selected Move:	2603	3	8	5	21500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,41

## ITERATION 54 #######################


> Neighbours evaluated; 16
> Selected Move:	2670	2	9	-1	15500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,415

## ITERATION 55 #######################


> Neighbours evaluated; 26
> Selected Move:	2710	3	7	3	16000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 56 #######################


> Neighbours evaluated; 29
> Selected Move:	2640	3	5	8	15500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 57 #######################


> Neighbours evaluated; 31
> Selected Move:	2725	1	-1	4	21000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 58 #######################


> Neighbours evaluated; 20
> Selected Move:	2575	3	8	5	21500


> New Y[]: 
	
	 2  3  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 59 #######################


> Neighbours evaluated; 17
> Selected Move:	2493	3	4	8	20500


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 60 #######################


> Neighbours evaluated; 22
> Selected Move:	2630	3	3	2	18500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,445

## ITERATION 61 #######################


> Neighbours evaluated; 23
> Selected Move:	2630	3	6	3	19500


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 62 #######################


> Neighbours evaluated; 26
> Selected Move:	2630	2	8	-1	15000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 63 #######################


> Neighbours evaluated; 25
> Selected Move:	2630	3	3	6	14000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,44

## ITERATION 64 #######################


> Neighbours evaluated; 21
> Selected Move:	2630	3	6	7	14500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,435

## ITERATION 65 #######################


> Neighbours evaluated; 24
> Selected Move:	2560	3	0	6	16200


> New Y[]: 
	
	 0  3  1  0  0  1  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 66 #######################


> Neighbours evaluated; 26
> Selected Move:	2610	3	5	9	17200


> New Y[]: 
	
	 0  3  1  0  0  0  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 67 #######################


> Neighbours evaluated; 22
> Selected Move:	2610	4	6	2	19000


> New Y[]: 
	
	 0  3  2  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 68 #######################


> Neighbours evaluated; 20
> Selected Move:	2610	4	2	7	16900


> New Y[]: 
	
	 0  3  1  0  0  0  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 69 #######################


> Neighbours evaluated; 22
> Selected Move:	2610	4	7	9	16600


> New Y[]: 
	
	 0  3  1  0  0  0  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 70 #######################


> Neighbours evaluated; 27
> Selected Move:	2580	3	9	4	16200


> New Y[]: 
	
	 0  3  1  0  2  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 71 #######################


> Neighbours evaluated; 26
> Selected Move:	2717	1	-1	8	20700


> New Y[]: 
	
	 0  3  1  0  2  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 72 #######################


> Neighbours evaluated; 23
> Selected Move:	2640	4	4	7	20900


> New Y[]: 
	
	 0  3  1  0  1  0  1  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 73 #######################


> Neighbours evaluated; 22
> Selected Move:	2723	3	7	3	20500


> New Y[]: 
	
	 0  3  1  2  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 74 #######################


> Neighbours evaluated; 23
> Selected Move:	2600	3	8	5	21000


> New Y[]: 
	
	 0  3  1  2  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 75 #######################


> Neighbours evaluated; 25
> Selected Move:	2531	3	3	7	21400


> New Y[]: 
	
	 0  3  1  0  1  1  1  2  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 76 #######################


> Neighbours evaluated; 20
> Selected Move:	2602	4	7	4	21200


> New Y[]: 
	
	 0  3  1  0  2  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 77 #######################


> Neighbours evaluated; 22
> Selected Move:	2490	2	7	-1	15700


> New Y[]: 
	
	 0  3  1  0  2  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 78 #######################


> Neighbours evaluated; 23
> Selected Move:	2560	3	4	7	15900


> New Y[]: 
	
	 0  3  1  0  0  1  1  2  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 79 #######################


> Neighbours evaluated; 23
> Selected Move:	2580	3	5	4	16400


> New Y[]: 
	
	 0  3  1  0  1  0  1  2  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 80 #######################


> Neighbours evaluated; 21
> Selected Move:	2580	4	7	2	18500


> New Y[]: 
	
	 0  3  2  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 81 #######################


> Neighbours evaluated; 20
> Selected Move:	2580	4	2	6	16700


> New Y[]: 
	
	 0  3  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 82 #######################


> Neighbours evaluated; 24
> Selected Move:	2540	3	7	9	17200


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 83 #######################


> Neighbours evaluated; 24
> Selected Move:	2540	4	6	2	19000


> New Y[]: 
	
	 0  3  2  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 84 #######################


> Neighbours evaluated; 20
> Selected Move:	2540	4	2	4	16700


> New Y[]: 
	
	 0  3  1  0  2  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 85 #######################


> Neighbours evaluated; 22
> Selected Move:	2540	4	4	9	16600


> New Y[]: 
	
	 0  3  1  0  1  0  1  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 86 #######################


> Neighbours evaluated; 25
> Selected Move:	2530	3	4	3	17100


> New Y[]: 
	
	 0  3  1  1  0  0  1  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 87 #######################


> Neighbours evaluated; 22
> Selected Move:	2530	4	9	2	19500


> New Y[]: 
	
	 0  3  2  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 88 #######################


> Neighbours evaluated; 19
> Selected Move:	2530	4	2	3	16500


> New Y[]: 
	
	 0  3  1  2  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 89 #######################


> Neighbours evaluated; 21
> Selected Move:	2565	1	-1	8	21000


> New Y[]: 
	
	 0  3  1  2  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 90 #######################


> Neighbours evaluated; 19
> Selected Move:	2504	3	3	4	21200


> New Y[]: 
	
	 0  3  1  0  2  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 91 #######################


> Neighbours evaluated; 19
> Selected Move:	2548	4	4	9	21100


> New Y[]: 
	
	 0  3  1  0  1  0  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 92 #######################


> Neighbours evaluated; 18
> Selected Move:	2623	3	4	7	21100


> New Y[]: 
	
	 0  3  1  0  0  0  1  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 93 #######################


> Neighbours evaluated; 17
> Selected Move:	2519	4	9	7	21400


> New Y[]: 
	
	 0  3  1  0  0  0  1  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 94 #######################


> Neighbours evaluated; 15
> Selected Move:	2490	2	9	-1	15400


> New Y[]: 
	
	 0  3  1  0  0  0  1  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 95 #######################


> Neighbours evaluated; 24
> Selected Move:	2560	3	7	0	13500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,38

## ITERATION 96 #######################


> Neighbours evaluated; 25
> Selected Move:	2600	3	2	7	15000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,385

## ITERATION 97 #######################


> Neighbours evaluated; 28
> Selected Move:	2560	3	6	2	14000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,39

## ITERATION 98 #######################


> Neighbours evaluated; 25
> Selected Move:	2560	3	7	3	14500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 99 #######################


> Neighbours evaluated; 26
> Selected Move:	2550	3	8	7	15500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 100 #######################


> Neighbours evaluated; 24
> Selected Move:	2505	1	-1	9	21500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 101 #######################


> Neighbours evaluated; 11
> Selected Move:	2440	2	2	-1	17500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 102 #######################


> Neighbours evaluated; 27
> Selected Move:	2520	3	3	5	16500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,375

## ITERATION 103 #######################


> Neighbours evaluated; 20
> Selected Move:	2520	3	7	2	15000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 104 #######################


> Neighbours evaluated; 21
> Selected Move:	2520	3	0	6	16700


> New Y[]: 
	
	 0  3  1  0  0  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 105 #######################


> Neighbours evaluated; 23
> Selected Move:	2530	3	5	3	17700


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 106 #######################


> Neighbours evaluated; 23
> Selected Move:	2500	3	9	4	17200


> New Y[]: 
	
	 0  3  1  1  1  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 107 #######################


> Neighbours evaluated; 23
> Selected Move:	2500	4	6	2	19000


> New Y[]: 
	
	 0  3  2  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 108 #######################


> Neighbours evaluated; 19
> Selected Move:	2500	4	2	3	16000


> New Y[]: 
	
	 0  3  1  2  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 109 #######################


> Neighbours evaluated; 20
> Selected Move:	2500	4	3	4	16700


> New Y[]: 
	
	 0  3  1  1  2  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 110 #######################


> Neighbours evaluated; 24
> Selected Move:	2512	1	-1	8	21200


> New Y[]: 
	
	 0  3  1  1  2  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 111 #######################


> Neighbours evaluated; 22
> Selected Move:	2423	3	3	5	20200


> New Y[]: 
	
	 0  3  1  0  2  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 112 #######################


> Neighbours evaluated; 22
> Selected Move:	2480	3	4	3	20000


> New Y[]: 
	
	 0  3  1  2  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 113 #######################


> Neighbours evaluated; 25
> Selected Move:	2533	3	8	9	21500


> New Y[]: 
	
	 0  3  1  2  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 114 #######################


> Neighbours evaluated; 18
> Selected Move:	2492	3	3	7	21900


> New Y[]: 
	
	 0  3  1  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 115 #######################


> Neighbours evaluated; 15
> Selected Move:	2596	4	7	9	21600


> New Y[]: 
	
	 0  3  1  0  0  1  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 116 #######################


> Neighbours evaluated; 19
> Selected Move:	2520	2	7	-1	16100


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 117 #######################


> Neighbours evaluated; 20
> Selected Move:	2520	4	9	2	18500


> New Y[]: 
	
	 0  3  2  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 118 #######################


> Neighbours evaluated; 17
> Selected Move:	2560	3	9	7	18000


> New Y[]: 
	
	 0  3  2  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 119 #######################


> Neighbours evaluated; 19
> Selected Move:	2560	4	2	5	16900


> New Y[]: 
	
	 0  3  1  0  0  2  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 120 #######################


> Neighbours evaluated; 26
> Selected Move:	2520	3	7	9	17400


> New Y[]: 
	
	 0  3  1  0  0  2  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 121 #######################


> Neighbours evaluated; 19
> Selected Move:	2490	3	9	4	16900


> New Y[]: 
	
	 0  3  1  0  1  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 122 #######################


> Neighbours evaluated; 19
> Selected Move:	2490	4	5	2	18000


> New Y[]: 
	
	 0  3  2  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 123 #######################


> Neighbours evaluated; 15
> Selected Move:	2490	4	2	6	16200


> New Y[]: 
	
	 0  3  1  0  1  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 124 #######################


> Neighbours evaluated; 22
> Selected Move:	2526	1	-1	7	21700


> New Y[]: 
	
	 0  3  1  0  1  1  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 125 #######################


> Neighbours evaluated; 21
> Selected Move:	2622	3	5	8	21200


> New Y[]: 
	
	 0  3  1  0  1  0  2  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 126 #######################


> Neighbours evaluated; 23
> Selected Move:	2503	3	4	9	21700


> New Y[]: 
	
	 0  3  1  0  0  0  2  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 127 #######################


> Neighbours evaluated; 20
> Selected Move:	2490	2	9	-1	15700


> New Y[]: 
	
	 0  3  1  0  0  0  2  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 128 #######################


> Neighbours evaluated; 24
> Selected Move:	2490	4	6	2	17500


> New Y[]: 
	
	 0  3  2  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 129 #######################


> Neighbours evaluated; 24
> Selected Move:	2490	4	2	8	16900


> New Y[]: 
	
	 0  3  1  0  0  0  1  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 130 #######################


> Neighbours evaluated; 26
> Selected Move:	2450	3	7	9	17400


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 131 #######################


> Neighbours evaluated; 21
> Selected Move:	2450	4	8	2	18000


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 132 #######################


> Neighbours evaluated; 20
> Selected Move:	2450	4	2	6	16200


> New Y[]: 
	
	 0  3  1  0  0  0  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 133 #######################


> Neighbours evaluated; 21
> Selected Move:	2493	1	-1	4	21700


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 134 #######################


> Neighbours evaluated; 20
> Selected Move:	2485	3	6	3	21500


> New Y[]: 
	
	 0  3  1  2  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 135 #######################


> Neighbours evaluated; 21
> Selected Move:	2510	3	8	6	22000


> New Y[]: 
	
	 0  3  1  2  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 136 #######################


> Neighbours evaluated; 18
> Selected Move:	2496	3	3	7	22400


> New Y[]: 
	
	 0  3  1  0  1  0  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 137 #######################


> Neighbours evaluated; 18
> Selected Move:	2585	4	7	9	22100


> New Y[]: 
	
	 0  3  1  0  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 138 #######################


> Neighbours evaluated; 19
> Selected Move:	2614	3	7	5	21600


> New Y[]: 
	
	 0  3  1  0  1  1  1  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 139 #######################


> Neighbours evaluated; 18
> Selected Move:	2580	4	9	4	21700


> New Y[]: 
	
	 0  3  1  0  2  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 140 #######################


> Neighbours evaluated; 16
> Selected Move:	2531	3	9	3	21700


> New Y[]: 
	
	 0  3  1  1  2  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 141 #######################


> Neighbours evaluated; 20
> Selected Move:	2443	3	4	9	22100


> New Y[]: 
	
	 0  3  1  1  0  1  1  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 142 #######################


> Neighbours evaluated; 17
> Selected Move:	2502	3	5	8	21600


> New Y[]: 
	
	 0  3  1  1  0  0  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 143 #######################


> Neighbours evaluated; 20
> Selected Move:	2450	2	3	-1	15600


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 144 #######################


> Neighbours evaluated; 19
> Selected Move:	2420	3	9	4	15200


> New Y[]: 
	
	 0  3  1  0  2  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 145 #######################


> Neighbours evaluated; 20
> Selected Move:	2420	4	4	2	17500


> New Y[]: 
	
	 0  3  2  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 146 #######################


> Neighbours evaluated; 24
> Selected Move:	2420	4	2	6	15700


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 147 #######################


> Neighbours evaluated; 22
> Selected Move:	2420	4	6	8	16900


> New Y[]: 
	
	 0  3  1  0  1  0  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 148 #######################


> Neighbours evaluated; 23
> Selected Move:	2410	3	4	3	17400


> New Y[]: 
	
	 0  3  1  1  0  0  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 149 #######################


> Neighbours evaluated; 23
> Selected Move:	2480	3	8	5	17400


> New Y[]: 
	
	 0  3  1  1  0  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 150 #######################


> Neighbours evaluated; 21
> Selected Move:	2480	4	5	2	18500


> New Y[]: 
	
	 0  3  2  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 151 #######################


> Neighbours evaluated; 18
> Selected Move:	2480	4	2	3	15500


> New Y[]: 
	
	 0  3  1  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 152 #######################


> Neighbours evaluated; 17
> Selected Move:	2480	4	3	6	16700


> New Y[]: 
	
	 0  3  1  1  0  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 153 #######################


> Neighbours evaluated; 24
> Selected Move:	2450	3	6	9	17100


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 154 #######################


> Neighbours evaluated; 20
> Selected Move:	2470	3	5	4	17600


> New Y[]: 
	
	 0  3  1  1  1  0  0  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 155 #######################


> Neighbours evaluated; 22
> Selected Move:	2470	4	9	2	20000


> New Y[]: 
	
	 0  3  2  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 156 #######################


> Neighbours evaluated; 18
> Selected Move:	2470	4	2	3	17000


> New Y[]: 
	
	 0  3  1  2  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 157 #######################


> Neighbours evaluated; 19
> Selected Move:	2470	4	3	4	17700


> New Y[]: 
	
	 0  3  1  1  2  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 158 #######################


> Neighbours evaluated; 23
> Selected Move:	2450	3	4	5	18400


> New Y[]: 
	
	 0  3  1  1  0  2  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 159 #######################


> Neighbours evaluated; 19
> Selected Move:	2450	4	5	2	19500


> New Y[]: 
	
	 0  3  2  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 160 #######################


> Neighbours evaluated; 15
> Selected Move:	2520	3	2	0	17000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 161 #######################


> Neighbours evaluated; 21
> Selected Move:	2760	1	-1	6	22000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 162 #######################


> Neighbours evaluated; 16
> Selected Move:	2830	3	5	4	22500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 163 #######################


> Neighbours evaluated; 14
> Selected Move:	2828	3	4	8	21500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 164 #######################


> Neighbours evaluated; 15
> Selected Move:	2730	3	3	4	21000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 165 #######################


> Neighbours evaluated; 23
> Selected Move:	2693	3	8	5	21500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 166 #######################


> Neighbours evaluated; 21
> Selected Move:	2570	3	6	7	22000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,235

## ITERATION 167 #######################


> Neighbours evaluated; 19
> Selected Move:	2608	3	5	8	21500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,24

## ITERATION 168 #######################


> Neighbours evaluated; 20
> Selected Move:	2480	3	7	3	22000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 169 #######################


> Neighbours evaluated; 22
> Selected Move:	2450	2	4	-1	16500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 170 #######################


> Neighbours evaluated; 21
> Selected Move:	2450	3	3	2	14500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 171 #######################


> Neighbours evaluated; 19
> Selected Move:	2520	1	-1	5	19500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 172 #######################


> Neighbours evaluated; 22
> Selected Move:	2490	3	9	4	19000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 173 #######################


> Neighbours evaluated; 26
> Selected Move:	2490	3	2	6	20000


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,27

## ITERATION 174 #######################


> Neighbours evaluated; 26
> Selected Move:	2490	2	8	-1	15500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 175 #######################


> Neighbours evaluated; 21
> Selected Move:	2520	3	4	9	16000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,26

## ITERATION 176 #######################


> Neighbours evaluated; 18
> Selected Move:	2520	3	1	2	18400


> New Y[]: 
	
	 2  0  3  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 177 #######################


> Neighbours evaluated; 20
> Selected Move:	2610	3	5	7	18900


> New Y[]: 
	
	 2  0  3  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 178 #######################


> Neighbours evaluated; 25
> Selected Move:	2610	4	2	6	17200


> New Y[]: 
	
	 2  0  1  0  0  0  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 179 #######################


> Neighbours evaluated; 28
> Selected Move:	2614	1	-1	8	21700


> New Y[]: 
	
	 2  0  1  0  0  0  3  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 180 #######################


> Neighbours evaluated; 14
> Selected Move:	2910	4	6	9	20500


> New Y[]: 
	
	 2  0  1  0  0  0  1  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 181 #######################


> Neighbours evaluated; 19
> Selected Move:	2865	3	8	5	21000


> New Y[]: 
	
	 2  0  1  0  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 182 #######################


> Neighbours evaluated; 21
> Selected Move:	2800	3	7	4	21000


> New Y[]: 
	
	 2  0  1  0  1  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 183 #######################


> Neighbours evaluated; 22
> Selected Move:	2848	3	5	8	20500


> New Y[]: 
	
	 2  0  1  0  1  0  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 184 #######################


> Neighbours evaluated; 22
> Selected Move:	2775	3	8	7	21500


> New Y[]: 
	
	 2  0  1  0  1  0  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 185 #######################


> Neighbours evaluated; 23
> Selected Move:	2694	3	9	5	21600


> New Y[]: 
	
	 2  0  1  0  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 186 #######################


> Neighbours evaluated; 22
> Selected Move:	2662	4	5	6	21700


> New Y[]: 
	
	 2  0  1  0  1  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 187 #######################


> Neighbours evaluated; 24
> Selected Move:	2706	3	5	8	21200


> New Y[]: 
	
	 2  0  1  0  1  0  3  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 188 #######################


> Neighbours evaluated; 24
> Selected Move:	2675	4	6	7	21300


> New Y[]: 
	
	 2  0  1  0  1  0  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 189 #######################


> Neighbours evaluated; 22
> Selected Move:	2691	3	7	3	20900


> New Y[]: 
	
	 2  0  1  3  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 190 #######################


> Neighbours evaluated; 25
> Selected Move:	2626	3	8	5	21400


> New Y[]: 
	
	 2  0  1  3  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 191 #######################


> Neighbours evaluated; 24
> Selected Move:	2593	3	3	7	21800


> New Y[]: 
	
	 2  0  1  0  1  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 192 #######################


> Neighbours evaluated; 18
> Selected Move:	2580	2	5	-1	16800


> New Y[]: 
	
	 2  0  1  0  1  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 193 #######################


> Neighbours evaluated; 24
> Selected Move:	2610	3	4	9	17300


> New Y[]: 
	
	 2  0  1  0  0  0  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 194 #######################


> Neighbours evaluated; 25
> Selected Move:	2610	4	7	9	16000


> New Y[]: 
	
	 2  0  1  0  0  0  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 195 #######################


> Neighbours evaluated; 27
> Selected Move:	2580	3	9	4	16900


> New Y[]: 
	
	 2  0  1  0  3  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 196 #######################


> Neighbours evaluated; 23
> Selected Move:	2594	1	-1	8	21400


> New Y[]: 
	
	 2  0  1  0  3  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 197 #######################


> Neighbours evaluated; 22
> Selected Move:	2510	3	8	5	21900


> New Y[]: 
	
	 2  0  1  0  3  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 198 #######################


> Neighbours evaluated; 20
> Selected Move:	2490	2	7	-1	16400


> New Y[]: 
	
	 2  0  1  0  3  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 199 #######################


> Neighbours evaluated; 20
> Selected Move:	2560	3	4	7	16300


> New Y[]: 
	
	 2  0  1  0  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 200 #######################


> Neighbours evaluated; 23
> Selected Move:	2560	4	7	2	17900


> New Y[]: 
	
	 2  0  3  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 201 #######################


> Neighbours evaluated; 20
> Selected Move:	2580	3	5	4	18400


> New Y[]: 
	
	 2  0  3  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 202 #######################


> Neighbours evaluated; 19
> Selected Move:	2580	4	2	6	16700


> New Y[]: 
	
	 2  0  1  0  1  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 203 #######################


> Neighbours evaluated; 24
> Selected Move:	2560	3	4	5	16200


> New Y[]: 
	
	 2  0  1  0  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 204 #######################


> Neighbours evaluated; 21
> Selected Move:	2560	4	6	5	16100


> New Y[]: 
	
	 2  0  1  0  0  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 205 #######################


> Neighbours evaluated; 25
> Selected Move:	2523	1	-1	9	22100


> New Y[]: 
	
	 2  0  1  0  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,27
________________________________________________________________

Best solution found: 3620
Run Termination time: 31.01.2010 10:19:59
Run duration: 00:00:37.9375000
________________________________________________________________
